Parallel Processing of Large Node B-Trees
نویسندگان
چکیده
SRT dividers with overlapped quotient selection stages, " in P m. Abstmct-This work investigates the performance improvement by parallel processing of large node B-trees. The main contribution of this paper is a node partitioning scheme for B-trees to enhance concurrency. In the proposed method, the tree height is reduced by increasing the node size. However, it is shown that increasing node size alone in conventional E-trees on parallel disks may not improve the response time, and may even degrade the performance. The proposed method achieves better performance while avoiding this anomaly.
منابع مشابه
HCB-Tree: A Height Compressed B-Tree for Parallel Processing
B-tree type indexes are popular in database applications because they provide a fast access path to large databases. In this paper we present a new storage structure which is suitable for fast parallel searching by using B-tree like indexes [I]. We call this modified B_ tree structure the Height Compressed B_ tree (HCB_tree). The main results presented in this paper are that parallel processing...
متن کاملParallel Generation of t-ary Trees
A parallel algorithm for generating t-ary tree sequences in reverse B-order is presented. The algorithm generates t-ary trees by 0-1 sequences, and each 0-1 sequences is generated in constant average time O(1). The algorithm is executed on a CREW SM SIMD model, and is adaptive and cost-optimal. Prior to the discussion of the parallel algorithm a new sequential generation with O(1) average time ...
متن کاملTwo-stage fuzzy-stochastic programming for parallel machine scheduling problem with machine deterioration and operator learning effect
This paper deals with the determination of machine numbers and production schedules in manufacturing environments. In this line, a two-stage fuzzy stochastic programming model is discussed with fuzzy processing times where both deterioration and learning effects are evaluated simultaneously. The first stage focuses on the type and number of machines in order to minimize the total costs associat...
متن کاملHISTIOCYTE-RICH B-CELL LYMPHOMA: A CASE REPORT OF A RARE VARIANT OF DIFFUSE LARGE B-CELL LYMPHOMA
The authors describe a case of histiocyte-rich B-cell lymphoma (HR-BCL), a variant of diffuse large B-cell lymphoma, in a 51-year-old man. The patient presented with large axillary lymphadenopathy. Histopathologic and immunohistochemical examination of lymph node biopsy revealed diffuse effacement of the lymph node architecture by reactive histiocytes and neoplastic CD20 positive B cells. ...
متن کاملHighly Scalable Data Balanced Distributed B-trees
Scalable distributed search structures are needed to maintain large volumes of data and for parallel databases. In this paper, we analyze the performance of two large scale data-balanced distributed search structures, the dB-tree and the dE-tree. The dB-tree is a distributed B-tree that replicates its interior nodes. The dE-tree is a dB-tree in which leaf nodes represent key ranges, and thus re...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- IEEE Trans. Computers
دوره 39 شماره
صفحات -
تاریخ انتشار 1990